A nested decomposition algorithm for parallel computations of very large sparse systems
نویسندگان
چکیده
منابع مشابه
A Parallel Algorithm for Computing the Extremal Eigenvalues of Very Large Sparse Matrices
Abs t rac t . Quantum mechanics often give rise to problems where one needs to find a few eigenvalues of very large sparse matrices. The size of the matrices is such that it is not possible to store them in main memory but instead they must be generated on the fly. In this paper the method of coordinate relaxation is applied t o o n e class of such problems. A parallel algorithm based on graph ...
متن کاملA partition-based algorithm for clustering large-scale software systems
Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...
متن کاملA Nested Dissection Approach to Sparse Matrix Partitioning for Parallel Computations
We consider how to distribute sparse matrices among processes to reduce communication costs in parallel sparse matrix computations, specifically, sparse matrix-vector multiplication. Our main contributions are: (i) an exact graph model for communication with general (two-dimensional) matrix distribution, and (ii) a recursive partitioning algorithm based on nested dissection (substructuring). We...
متن کاملA Decomposition-based Control Strategy for Large, Sparse Dynamic Systems
We propose a new output control design for large, sparse dynamic systems. A graphtheoretic decomposition is used to cluster the states, inputs, and outputs, and to identify an appropriate bordered block diagonal structure for the gain matrix. The resulting control law can be easily implemented in a multiprocessor environment with a minimum of communication. A large-scale problem is considered t...
متن کاملParallel and Nested Decomposition for Factoid Questions
Typically, automatic Question Answering (QA) approaches use the question in its entirety in the search for potential answers. We argue that decomposing complex factoid questions into separate facts about their answers is beneficial to QA, since an answer candidate with support coming from multiple independent facts is more likely to be the correct one. We broadly categorize decomposable questio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 1995
ISSN: 1024-123X,1563-5147
DOI: 10.1155/s1024123x95000068